On the static assignment to parallel servers
نویسنده
چکیده
We study the static assignment to M parallel, exponential, heterogeneous servers. Blocked customers are lost, while the objective is to minimize the average number of blocked customers. The problem is formulated as a stochastic control problem with partial observation, and an equivalent full observation problem is formulated. Numerical experiments are conducted and the structure of the optimal policies is studied.
منابع مشابه
A CSA Method for Assigning Client to Servers in Online Social Networks
This paper deals with the problem of user-server assignment in online social network systems. Online social network applications such as Facebook, Twitter, or Instagram are built on an infrastructure of servers that enables them to communicate with each other. A key factor that determines the facility of communication between the users and the servers is the Expected Transmission Time (ETT). A ...
متن کاملLiterature Review of Traffic Assignment: Static and Dynamic
Rapid urban growth is resulting into increase in travel demand and private vehicle ownership in urban areas. In the present scenario the existing infrastructure has failed to match the demand that leads to traffic congestion, vehicular pollution and accidents. With traffic congestion augmentation on the road, delay of commuters has increased and reliability of road network has decreased. Four s...
متن کاملMinimisation of the Average Response Time in a Cluster of Servers
In this paper, we consider task assignment problem in a cluster of servers. We show that optimal static task assignment is tantamount to equalizing an appropriate cost functions associated with the servers. We also propose an improvement of dynamic Shortest Expected Delay (SED) task assignment policy.
متن کاملAssigning Multiple Job Types to Parallel Specialized Servers
In this paper methods of mixing decision rules are investigated and applied to the so-called multiple job type assignment problem with specialized servers which is modeled as continuous time Markov decision process. Performance optimization is difficult for this assignment problem, but optimization over the class of static policies is tractable. By applying the described mixing methods a suitab...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Automat. Contr.
دوره 44 شماره
صفحات -
تاریخ انتشار 1999